Real-time path planning in heterogeneous environments

نویسندگان

  • Norman Jaklin
  • Atlas F. Cook
  • Roland Geraerts
چکیده

Modern virtual environments can contain a variety of characters and traversable regions. Each character may have different preferences for the traversable region types. Pedestrians may prefer to walk on sidewalks, but they may occasionally need to traverse roads and dirt paths. By contrast, wild animals might try to stay in forest areas, but they are able to leave their protective environment when necessary. This paper presents a novel path planning method named MIRAN (Modified Indicative Routes and Navigation) that takes a character’s region preferences into account. Given an indicative route as a rough estimation of a character’s preferred route, MIRAN efficiently computes a visually convincing path that is smooth, keeps clearance from obstacles, avoids unnecessary detours, and allows local changes to avoid other characters. To the best of our knowledge, MIRAN is the first path planning method that supports the above features while using an exact representation of the navigable space. Experiments show that with our approach a wide range of different character behaviors can be simulated. It also overcomes problems that occur in previous path planning methods such as the Indicative Route Method. The resulting paths are well-suited for real-time simulations and gaming applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation

We describe and demonstrate the Explicit Corridor Map (ECM), a navigation mesh for path planning and crowd simulation in virtual environments. For a bounded 2D environment with polygonal obstacles, the ECM is the medial axis of the free space annotated with nearest-obstacle information. It can be used to compute short and smooth paths for disk-shaped characters of any radius. It is also well-de...

متن کامل

Path Planning for a Robot Manipulator based on Probabilistic Roadmap and Reinforcement Learning

The probabilistic roadmap (PRM) method, which is a popular path planning scheme, for a manipulator, can find a collision-free path by connecting the start and goal poses through a roadmap constructed by drawing random nodes in the free configuration space. PRM exhibits robust performance for static environments, but its performance is poor for dynamic environments. On the other hand, reinforcem...

متن کامل

Real-Time Path Planning and Navigation for Multi-agent and Crowd Simulations

We survey some of our recent work on real-time path planning and navigation of multiple autonomous agents in dynamic environments. The driving application of our work are real-time crowd simulation for computer games, virtual environments, and avatar-based online 3D social networks. We also present extensions to these methods for accelerating the overall simulation and for modeling more complex...

متن کامل

Real-time path planning using harmonic potentials in dynamic environments

Motivated by fluid analogies, artificial harmonic potentials can eliminate local m in ima problems in robot path planning. I n this paper, simple analytical solut ions t o planar harmonic potentials are derived using tools f r o m fluid mechanics, and are applied t o two-dimensional planning among multiple moving obstacles. These closed-form solutions enable real-time computation to be readily ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Visualization and Computer Animation

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2013